Snapshot Centrality Indices in Dynamic FIFO Networks

نویسندگان

  • Tatiana Tabirca
  • Kenneth N. Brown
  • Cormac J. Sreenan
چکیده

The article introduces the concept of snapshot dynamic indices as centrality measures to analyse how the importance of nodes changes over time in dynamic networks. In particular, the dynamic stress-snapshot and dynamic betweenness snapshot are investigated. We present theoretical results on dynamic shortest paths in firstin first-out dynamic networks, and then introduce some algorithms for computing these indices in the discrete-time case. Finally, we present some experimental results exploring the algorithms’ efficiency and illustrating the variation of the dynamic betweenness snapshot index for some sample dynamic networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Message efficient global snapshot recording using a self stabilizing spanning tree in a MANET

Distributed snapshots are a significant paradigm for distributed systems. These are applied for constructing checkpoint protocols, apart from investigating, testing, or proving properties in distributed executions such as deadlocks and termination. Though a number of snapshot algorithms exist for traditional distributed systems, they cannot be directly applied to mobile ad hoc networks due to t...

متن کامل

Centrality and Spectral Radius in Dynamic Communication Networks

We explore the influence of the choice of attenuation factor on Katz centrality indices for evolving communication networks. For given snapshots of a network observed over a period of time, recently developed communicability indices aim to identify best broadcasters and listeners in the network. In this article, we looked into the sensitivity of communicability indices on the attenuation factor...

متن کامل

Analysis of Distributed Snapshot Algorithms

Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are “computation has terminate”, “the...

متن کامل

Centrality in affiliation networks

This paper discusses the conceptualization, measurement, and interpretation of centrality in affiliation networks. Although centrality is a well-studied topic in social network analysis, and is one of the most widely used properties for studying affiliation networks, virtually all discussions of centrality and centralization have concerned themselves with one-mode networks. Bonacich's work on s...

متن کامل

The Influence of Location on Nodes’ Centrality in Location-Based Social Networks

Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Math. Model. Algorithms

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2011